In the Bayesian approach to quantum mechanics, probabilities—and thus quantum states—represent an agent’s degrees of belief, rather than corresponding to objective properties of physical systems. In this paper we investigate the concept of certainty in quantum mechanics. Particularly, we show how the probability-1 predictions derived from pure quantum states highlight a fundamental difference between our Bayesian approach, on the one hand, and Copenhagen and similar interpretations on the other. We first review the main arguments for the general claim that probabilities (...) always represent degrees of belief. We then argue that a quantum state prepared by some physical device always depends on an agent’s prior beliefs, implying that the probability-1 predictions derived from that state also depend on the agent’s prior beliefs. Quantum certainty is therefore always some agent’s certainty. Conversely, if facts about an experimental setup could imply agent-independent certainty for a measurement outcome, as in many Copenhagen-like interpretations, that outcome would effectively correspond to a preexisting system property. The idea that measurement outcomes occurring with certainty correspond to preexisting system properties is, however, in conflict with locality. We emphasize this by giving a version of an argument of Stairs [(1983). Quantum logic, realism, and value-definiteness. Philosophy of Science, 50, 578], which applies the Kochen–Specker theorem to an entangled bipartite system. (shrink)

We prove a Gleason-type theorem for the quantum probability rule using frame functions defined on positive-operator-valued measures, as opposed to the restricted class of orthogonal projection-valued measures used in the original theorem. The advantage of this method is that it works for two-dimensional quantum systems and even for vector spaces over rational fields—settings where the standard theorem fails. Furthermore, unlike the method necessary for proving the original result, the present one is rather elementary. In the case of a qubit, we (...) investigate similar results for frame functions defined upon various restricted classes of POVMs. For the so-called trine measurements, the standard quantum probability rule is again recovered. (shrink)

We consider measurements, described by a positive-operator-valued measure (POVM), whose outcome probabilities determine an arbitrary pure state of a D-dimensional quantum system. We call such a measurement a pure-state informationally complete (PS I-complete) POVM. We show that a measurement with 2D−1 outcomes cannot be PS I-complete, and then we construct a POVM with 2D outcomes that suffices, thus showing that a minimal PS I-complete POVM has 2D outcomes. We also consider PS I-complete POVMs that have only rank-one POVM elements and (...) construct an example with 3D−2 outcomes, which is a generalization of the tetrahedral measurement for a qubit. The question of the minimal number of elements in a rank-one PS I-complete POVM is left open. (shrink)

The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a demand for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. To be scalable, the effective number of degrees of freedom in the computer must grow nearly linearly with the number of qubits in an (...) equivalent qubit-based quantum computer. (shrink)